package day_2022_9_to_12.Day;

/**
 * @author haomin
 * @date 2022/09/03 22:40
 **/
public class Day1_2_Num6171_FindSubarrays {
    class Solution {
        public boolean findSubarrays(int[] nums) {
            for(int i = 0; i < nums.length-1; ++i){
                for(int j = i + 1; j < nums.length-1; ++j){
                    if(nums[i] + nums[i+1] == nums[j] + nums[j+1]) return true;
                }
            }
            return false;
        }
    }
}